Efficient distributed SAT and SAT-based distributed Bounded Model Checking
نویسندگان
چکیده
منابع مشابه
Simple Yet Efficient Improvements of SAT Based Bounded Model Checking
In this paper, we show how proper benchmarking, which matches day-to-day use of formal methods, allows us to assess direct improvements for SAT use for formal methods. Proper uses of our benchmark allowed us to prove that previous results on tuning SAT solver for Bounded Model Checking (BMC) were overly optimistic and that a simpler algorithm was in fact more efficient.
متن کاملEfficient SAT-based Bounded Model Checking for Software Verification
This paper discusses our methodology for formal analysis and automatic verification of software programs. It is currently applicable to a large subset of the C programming language that includes bounded recursion. We consider reachability properties, in particular whether certain assertions or basic blocks are reachable in the source code. We perform this analysis via a translation to a Boolean...
متن کاملBenchmarking SAT Solvers for Bounded Model Checking
Modern SAT solvers are highly dependent on heuristics. Therefore, benchmarking is of prime importance in evaluating the performances of different solvers. However, relevant benchmarking is not necessarily straightforward. We present our experiments using the IBM CNF Benchmark on several SAT solvers. Using the results, we attempt to define guidelines for a relevant benchmarking methodology, usin...
متن کاملTuning SAT Checkers for Bounded Model Checking
Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search for a counter example in executions whose length is bounded by some integer k. The BMC problem can be eeciently reduced to a propositional satissabil-ity problem, and can therefore be solved by SAT methods rather than BDDs. SAT p...
متن کاملTuning SAT checkers for Bounded Model Checking
Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search for a counter example in executions whose length is bounded by some integer k. The BMC problem can be e ciently reduced to a propositional satis ability problem, and can therefore be solved by SAT methods rather than BDDs. SAT pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Software Tools for Technology Transfer
سال: 2006
ISSN: 1433-2779,1433-2787
DOI: 10.1007/s10009-005-0203-z